Interactive proof system

Results: 103



#Item
61Complexity classes / Cryptographic protocols / Non-interactive zero-knowledge proof / Zero-knowledge proof / NP / Proof of knowledge / Oracle machine / IP / PP / Theoretical computer science / Computational complexity theory / Cryptography

An Extension of the Groth-Sahai Proof System Sarah Meiklejohn [removed] Sc.B., Brown University, 2008 Thesis Advisor: Anna Lysyanskaya

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Language: English - Date: 2014-09-03 04:47:55
62IP / Distance-bounding protocol / Zero-knowledge proof / NP / XTR / Proof of knowledge / Interactive proof system / Cryptographic protocols / Cryptography / Applied mathematics

Optimal Proximity Proofs Ioana Boureanu1 and Serge Vaudenay2 1 Akamai Technologies Limited EMEA HQ, UK

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-09-03 11:34:57
63IP / Zero-knowledge proof / NP / Soundness / Distance-bounding protocol / Support / Commitment scheme / Alice and Bob / Interactive proof system / Cryptographic protocols / Cryptography / Applied mathematics

Proof of Proximity of Knowledge Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-09-04 02:29:08
64Complexity classes / Mathematics / Zero-knowledge proof / Interactive proof system / NP / IP / Soundness / Standard model / Cipher / Applied mathematics / Cryptographic protocols / Cryptography

Interactive Proofs under Continual Memory Leakage Prabhanjan Ananth∗ University of California, Los Angeles, USA [removed] Vipul Goyal

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-08-24 12:01:41
65Cryptographic protocols / Public-key cryptography / Complexity classes / Zero-knowledge proof / Interactive proof system / Probabilistic complexity theory / RSA / NP / IP / Cryptography / Theoretical computer science / Computational complexity theory

ZERO KNOWLEDGE AND THE DEPARTMENT OF DEFENSE Susan Landau The game is simple and apparently paradoxical: Prove you know something— an ID number, an access code—without revealing even a single bit of the information i

Add to Reading List

Source URL: privacyink.org

Language: English - Date: 2011-11-13 12:10:06
66Formal sciences / Silvio Micali / Shafi Goldwasser / Charles Rackoff / Gödel Prize / Semantic security / Interactive proof system / ACM SIGACT / Provable security / Cryptography / Women in technology / Theoretical computer science

acm Association for Computing Machinery Advancing Computing as a Science & Profession Contact: Virginia Gold

Add to Reading List

Source URL: awards.acm.org

Language: English - Date: 2013-05-21 15:34:04
67Computational complexity theory / Quantum complexity theory / Models of computation / Interactive proof system / Quantum computer / BQP / IP / Quantum algorithm / Probabilistic Turing machine / Theoretical computer science / Applied mathematics / Quantum information science

Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov∗and Umesh Vazirani† June 19, 2012 arXiv:1206.3686v1 [quant-ph] 16 Jun 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-06-18 20:15:58
68Malleability / Semantic security / Commitment scheme / Zero-knowledge proof / Chosen-ciphertext attack / Interactive proof system / RSA / Non-interactive zero-knowledge proof / Proof of knowledge / Cryptography / Cryptographic protocols / Ciphertext indistinguishability

Construction of a Non-Malleable Encryption Scheme from Any Semantically Secure One Rafael Pass1 , abhi shelat2 , and Vinod Vaikuntanathan3 1 Cornell University

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-02-04 10:24:17
69Cryptographic protocols / IP / Non-interactive zero-knowledge proof / Random oracle / Interactive proof system / Proof of knowledge / Zero-knowledge proof / PP / Oracle machine / Cryptography / Theoretical computer science / Applied mathematics

Non-interactive zero-knowledge proofs in the quantum random oracle model Dominique Unruh University of Tartu July 29, 2014

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-07-29 10:21:03
70Cryptographic protocols / Interactive proof system / Zero-knowledge proof / Proof of knowledge / NP / IP / Snark / Probabilistically checkable proof / Commitment scheme / Cryptography / Theoretical computer science / Applied mathematics

The Hunting of the SNARK∗ Nir Bitansky† Ran Canetti‡ Alessandro Chiesa§

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-07-24 21:35:42
UPDATE